Multi-Dimensional Logic Programming: Theoretical Foundations
نویسندگان
چکیده
This paper introduces an extension of logic programming based on multi-dimensional logics, called MLP. In a multi-dimensional logic the values of elements vary depending on more than one dimension, such as time and space. The resulting logic programming language is suitable for modelling objects which involve implicit and/or explicit temporal and spatial dependencies. The execution of programs of the language is based on a resolution-type proof procedure called MSLD-resolution (for Multi-dimensional SLD-resolution). MSLD-resolution is based on the axioms and rules of inference of the underlying multi-dimensional logic. The paper also establishes the declarative semantics of multi-dimensional logic programs , based on an extension of Herbrand models. In particular, it is shown that MLP programs satisfy the minimum model semantics. A novel multidimensional interface to MLP is also outlined; it can be used as a powerful development tool with the advantage non-determinism inherent in logic programming.
منابع مشابه
Mj-prolog | 1. Proof Theoretical Foundations | 1 Foundations of Classical Logic Programming
In this article we give the proof theoretical foundations of an extension of Prolog, to be called mj-Prolog, for dealing with representations of recursive functions, as Pro-log deals with terms. In opposition to other related systems, mj-Prolog remains in the framework of rst order intuitionistic logic, recursive functions are determined and represented by equations that on one side have the us...
متن کاملNotes on Predicate Calculus and Logic Programming
[1] Apt, K. R.: Logic Programming, Handbook of Theoretical Computer Science (J. van Leeuwen, ed.), Elsevier Science Publishers B.V., 1990. [2] Chang, C.-L. and Lee, R. C.-T.: Symbolic Logic and Mechanical Theorem Proving, Academic Press Inc., 1973. [3] Kowalski, R.: Logic for Problem Solving, North Holland, 1979. [4] Lloyd, J. W.: Foundations of Logic Programming, 2nd Edition, Springer Verlag, ...
متن کاملNotes on Predicate Calculus and Logic Programming
[1] Apt, K. R.: Logic Programming, Handbook of Theoretical Computer Science (J. van Leeuwen, ed.), Elsevier Science Publishers B.V., 1990. [2] Chang, C.-L. and Lee, R. C.-T.: Symbolic Logic and Mechanical Theorem Proving, Academic Press Inc., 1973. [3] Kowalski, R.: Logic for Problem Solving, North Holland, 1979. [4] Lloyd, J. W.: Foundations of Logic Programming, 2nd Edition, Springer Verlag, ...
متن کاملDeclarative Debugging in Constraint Logic Programming: the Cover Relation
This work is motivated by the declarative insuuciency diagnosis of constraint logic programs, but focuses only, in this paper, on theoretical viewpoints. Many techniques have been developed for logic programming but cannot be merely adapted to constraint logic programming. An answer is not covered by a more general computed answer any more. Practical implementations use incomplete solvers with ...
متن کاملFunctional Logic Programming: From Theory to Curry
Functional logic programming languages combine the most important declarative programming paradigms, and attempts to combine these paradigms have a long history. The declarative multi-paradigm language Curry is influenced by recent advances in the foundations and implementation of functional logic languages. The development of Curry is an international initiative intended to provide a common pl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Theor. Comput. Sci.
دوره 185 شماره
صفحات -
تاریخ انتشار 1997